Closure Properties of Independence Concepts for Continuous Utilities
نویسنده
چکیده
This paper examines nine independence concepts for ordinal and expected utilities: utility and preference independence, weak separability (a uniqueness of nonstrict conditional preferences), as well as generalizations that allow for complete indifference or reversal of preferences. Some of these conditions are closed under set-theoretic operations, which simplifies the verification of such assumptions in a practical decision analysis. Preference independence is closed under union without assumptions of strict essentiality, which are however necessary for closure under differences of preference independence and its mentioned generalizations. The well-known additive representation of a utility function is used, in a corrected form with a self-contained proof, to show closure under symmetric difference. This generalizes a classical result of Gorman (1968), and supplements its proof. Generalized utility independence has all, whereas weak separability has no closure properties. An independent set of any kind is utility or preference independent if this holds for a subset. Counterexamples are given throughout to show that the results are as strong as possible. The approach consistently uses conditional functions instead of preference relations, based on simple topological notions like connectivity and continuity.
منابع مشابه
ON SOMEWHAT FUZZY AUTOMATA CONTINUOUS FUNCTIONS IN FUZZY AUTOMATA TOPOLOGICAL SPACES
In this paper, the concepts of somewhat fuzzy automata continuous functions and somewhat fuzzy automata open functions in fuzzy automata topological spaces are introduced and some interesting properties of these functions are studied. In this connection, the concepts of fuzzy automata resolvable spaces and fuzzy automata irresolvable spaces are also introduced and their properties are studied.
متن کاملIndependence and Qualitative Decision Theory
Probabilistic independence has proved to be a fundamental tool that can dramatically simplify the task of eliciting, representing, and computing with probabilities. We advance the position that notions of utility independence can serve similar functions when reasoning about preferences and utilities during decision making. In this paper we first summarize existing results and definitions concer...
متن کاملOn Chain Graph Models for Description of Conditional Independence
A chain graph (CG) is a graph admitting both directed and undi-rected edges with (partially) directed cycles forbidden. It generalizes both the concept of undirected graph (UG) and the concept of directed acyclic graph (DAG). A chain graph can be used to describe eeciently the conditional independence structure of a multidimensional discrete probability distribution in the form of a graphoid, t...
متن کاملSome Properties of Continuous $K$-frames in Hilbert Spaces
The theory of continuous frames in Hilbert spaces is extended, by using the concepts of measure spaces, in order to get the results of a new application of operator theory. The $K$-frames were introduced by G$breve{mbox{a}}$vruta (2012) for Hilbert spaces to study atomic systems with respect to a bounded linear operator. Due to the structure of $K$-frames, there are many differences between...
متن کاملTopics on the Ratliff-Rush Closure of an Ideal
Introduction Let be a Noetherian ring with unity and be a regular ideal of , that is, contains a nonzerodivisor. Let . Then . The :union: of this family, , is an interesting ideal first studied by Ratliff and Rush in [15]. The Ratliff-Rush closure of is defined by . A regular ideal for which is called Ratliff-Rush ideal. The present paper, reviews some of the known prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 18 شماره
صفحات -
تاریخ انتشار 1993